A universal k-tree model for content-based multimedia retrieval

نویسندگان

  • Nikitas A. Alexandridis
  • Punpiti Piamsa-nga
چکیده

In this paper, we propose a unified model for indexing and retrieving multimedia data using characteristic features and multiresolution processing. Each multimedia datatype, such as audio and video, is represented as a k-dimensional signal in the spatio-temporal domain. A k-dimensional signal is transformed into characteristic features (contents) and these features are stored in a hierarchical multidimensional structure, called the k-tree. With this approach, both the retrieval accuracy and the response time can be dynamically adapted. We investigate the multimedia data representation and classify types of data retrieval based on such a universal ktree representation of the characteristic features. We propose multiresolution approaches to content-based multimedia search and retrieval.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallel Model for Multimedia Retrieval Based on Multidimensional Signal Structure

Abstract: In this paper, we propose a parallel, unified model for the indexing and retrieval by content of multimedia data using multiresolution processing. Each multimedia data type can be represented by k-dimensional (k-d) signals in the spatio-temporal domain. [1] These k-d signals are separated into small blocks and then formed into a multidimensional tree structure, called a k-tree. Using ...

متن کامل

A parallel algorithm for multi-feature content-based multimedia retrieval

In this paper, we propose a parallel, unified model for the indexing and retrieval by content of multimedia data using a weighted cascade. [4] Each multimedia data type can be viewed as k-dimensional (k-d) data in spatiotemporal domain. [3] Each dimension of the data is separated into small blocks and then formed into a multidimensional tree structure, called a k-tree. Using the ktree structure...

متن کامل

Parallel Processing Algorithms for Content-based Retrieval from a Multimedia Database

The paper proposes a data partitioning algorithm for content-based retrieval from a multimedia database using a homogeneous cluster system. The multimedia data are represented in a unified model formed into a hierarchical multidimensional k-tree structure. The parallel retrieval algorithms run on a cluster of homogeneous processing units using a dedicated type of shared memory. We use system ch...

متن کامل

Content-based Multimedia Data Retrieval on Heterogeneous System Environment

In this paper, we propose a static data partitioning scheme for content-based multimedia data retrieval using a heterogeneous cluster system. Multimedia data is represented by unified k-tree structure of kdimensional(k-d) signals proposed in [6]. Each dimension of k-d data is separated into small blocks and then formed into a hierarchical multidimensional tree structure, called a k-tree. The pa...

متن کامل

Balancing Strategies for Parallel Content-based Data Retrieval Algorithms in a k-tree Structured Database

The paper proposes a unified model for multimedia data retrieval which includes data representatives, content representatives, index structure, and search algorithms. The multimedia data are defined as k-dimensional signals indexed in a multidimensional k-tree structure. The benefits of using the k-tree unified model were demonstrated by running the data retrieval application on a six networked...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998